Blocked LU Factorization on a Multiprocessor Computer
نویسندگان
چکیده
منابع مشابه
Performance Complexity of Lu Factorization with Eecient Pipelining and Overlap on a Multiprocessor
In this paper, we make eecient use of pipelining on LU decomposition with pivoting and a column-scattered data decomposition to derive precise variations of the computational complexities. We then compare these results with experiments on the Intel iPSC/860 and Paragon machines.
متن کاملLu Factorization on Parallel Computers
Abstract-A new parallel algorithm for the LU factorization of a given dense matrix A is described. The case of banded matrices is also considered. This algorithm can be combined with Sameh and Brent’s [SIAM J. Numer. Anal. 14, 1101-I 113. (1977)] to obtain the solution of a linear system of algebraic equations. The arithmetic complexity for the dense case is in’ ($bn in the banded case), using ...
متن کاملParallelizing LU Factorization
Systems of linear equations can be represented by matrix equations of the form A~x = ~b. LU Factorization is a method for solving systems in this form by transforming the matrix A into a form that makes backwards and forward susbstitution feasible. A common algorithm for LU factorization is Gaussian elimination, which I used for my serial and parallel implementations. I investigated using async...
متن کاملBlock LU Factorization
Many of the currently popular \block algorithms" are scalar algorithms in which the operations have been grouped and reordered into matrix operations. One genuine block algorithm in practical use is block LU factorization, and this has recently been shown by Demmel and Higham to be unstable in general. It is shown here that block LU factorization is stable if A is block diagonally dominant by c...
متن کاملSparse LU factorization on the CRAY T3D
The paper describes a parallel algorithm for the LU fac-torization of sparse matrices on distributed memory machines by using SPMD as programming model and PVM as message passing interface. We address all the diiculties arising in sparse codes, as the ll-in or the dynamic movement of data inside the matrix. The cyclic distribution has been used to evenly distribute the elements onto a mesh of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Civil and Infrastructure Engineering
سال: 1993
ISSN: 1093-9687
DOI: 10.1111/j.1467-8667.1993.tb00191.x